Recursive functions and intuitionistic number theory

On the Interpretation of Intuitionistic Number Theory

Theory of Provable Recursive Functions

Solving Recursive Domain Equations in Models of Intuitionistic Set Theory

Synopsis We give a general axiomatic construction of solutions to recursive domain equations, applicable both to classical models of domain theory and to realizability models. The approach is based on embedding categories of predomains in models of intuitionistic set theory. We show that the existence of solutions to recursive domain equations depends on the strength of the set theory. Such sol...

Transfinite Ordinals in Recursive Number Theory

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...

Functions of Number Theory

Multiplicative Number Theory 638 27.2 Functions . . . . . . . . . . . . . . . . . 638 27.3 Multiplicative Properties . . . . . . . . . 640 27.4 Euler Products and Dirichlet Series . . . 640 27.5 Inversion Formulas . . . . . . . . . . . . 641 27.6 Divisor Sums . . . . . . . . . . . . . . . 641 27.7 Lambert Series as Generating Functions . 641 27.8 Dirichlet Characters . . . . . . . . . . . . 642...